Computation of VaR and CVaR using stochastic approximations and unconstrained importance sampling
نویسنده
چکیده
Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) are two risk measures which are widely used in the practice of risk management. This paper deals with the problem of computing both VaR and CVaR using stochastic approximation (with decreasing steps): we propose a first Robbins-Monro procedure based on Rockaffelar-Uryasev’s identity for the CVaR. The convergence rate of this algorithm to its target satisfies a Gaussian Central Limit Theorem. As a second step, in order to speed up the initial procedure, we propose a recursive importance sampling (I.S.) procedure which induces a significant variance reduction of both VaR and CVaR procedures. This idea, which goes back to the seminal paper [1], follows a new approach introduced in [22]. Finally, we consider a deterministic moving risk level to speed up the initialization phase of the algorithm. We prove that the convergence rate of the resulting procedure is ruled by a Central Limit Theorem with minimal variance and its efficiency is illustrated by considering several typical energy portfolios.
منابع مشابه
Computation of VaR and CVaR using stochastic approximation and adaptive unconstrained importance sampling
Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) are two risk measures which are widely used in the practice of risk management. This paper deals with the problem of computing both VaR and CVaR using stochastic approximation (with decreasing steps): we propose a first Robbins-Monro procedure based on Rockaffelar-Uryasev’s identity for the CVaR. The convergence rate of this algorithm to ...
متن کاملComputing VaR and CVaR using stochastic approximation and adaptive unconstrained importance sampling
Value-at-Risk (VaR) and Conditional-Value-at-Risk (CVaR) are two risk measures which are widely used in the practice of risk management. This paper deals with the problem of estimating both VaR and CVaR using stochastic approximation (with decreasing steps): we propose a first Robbins-Monro (RM) procedure based on Rockafellar-Uryasev’s identity for the CVaR. Convergence rate of this algorithm t...
متن کاملAn Improved Procedure for VaR/CVaR Estimation under Stochastic Volatility Models
This paper proposes an improved procedure for stochastic volatility model estimation with an application in risk management. This procedure is composed of the following instrumental components: Fourier transform method for volatility estimation with a price correction scheme, and importance sampling for extremal event probability estimation with applications to estimate Value-at-Risk and condit...
متن کاملAsymptotic representations for importance-sampling estimators of value-at-risk and conditional value-at-risk
Value-at-risk (VaR) and conditional value-at-risk (CVaR) are important risk measures. They are often estimated by using importance sampling (IS) techniques. In this paper, we derive the asymptotic representations for IS estimators of VaR and CVaR. Based on these representations, we are able to prove the consistency and asymptotic normality of the estimators and to provide simple conditions unde...
متن کاملPolicy Gradients for CVaR-Constrained MDPs
We study a risk-constrained version of the stochastic shortest path (SSP) problem, where the risk measure considered is Conditional Value-at-Risk (CVaR). We propose two algorithms that obtain a locally risk-optimal policy by employing four tools: stochastic approximation, mini batches, policy gradients and importance sampling. Both the algorithms incorporate a CVaR estimation procedure, along t...
متن کامل